Measuring and comparing evolvability and constraint in multivariate characters.

نویسندگان

  • T F Hansen
  • D Houle
چکیده

The Lande equation forms the basis for our understanding of the short-term evolution of quantitative traits in a multivariate context. It predicts the response to selection as the product of an additive genetic variance matrix and a selection gradient. The selection gradient approximates the force and direction of selection, and the genetic variance matrix quantifies the role of the genetic system in evolution. Attempts to understand the evolutionary significance of the genetic variance matrix are hampered by the fact that the majority of the methods used to characterize and compare variance matrices have not been derived in an explicit theoretical context. We use the Lande equation to derive new measures of the ability of a variance matrix to allow or constrain evolution in any direction in phenotype space. Evolvability captures the ability of a population to evolve in the direction of selection when stabilizing selection is absent. Conditional evolvability captures the ability of a population to respond to directional selection in the presence of stabilizing selection on other trait combinations. We then derive measures of character autonomy and integration from these evolvabilities. We study the properties of these measures and show how they can be used to interpret and compare variance matrices. As an illustration, we show that divergence of wing shape in the dipteran family Drosophilidae has proceeded in directions that have relatively high evolvabilities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolvability and genetic constraint in Dalechampia blossoms: genetic correlations and conditional evolvability.

The short-term evolvability of a character is closely related to its level of additive genetic variation. However, a large component of the variation in any one character may be pleiotropically linked to other characters under the influence of different selective factors. Therefore, the organization of the organism into quasi-independent modules may be an important prerequisite for evolvability...

متن کامل

The Evolvability of Complex Organisms: The Quantitative Genetic Perspective

It is often assumed that genetic and/or phenotypic complexity decreases evolvability. In this paper results from quantitative genetic models are reviewed pertaining the factors determining the rate of evolution of multivariate phenotypes. It is found that the predictions strongly depend on assumptions about the genetic structure of the population. In populations with low amounts of genetic vari...

متن کامل

Evolvability and genetic constraint in Dalechampia blossoms: components of variance and measures of evolvability.

Many evolutionary arguments are based on the assumption that quantitative characters are highly evolvable entities that can be rapidly moulded by changing selection pressures. The empirical evaluation of this assumption depends on having an operational measure of evolvability that reflects the ability of a trait to respond to a given external selection pressure. We suggest short-term evolvabili...

متن کامل

Is modularity necessary for evolvability? Remarks on the relationship between pleiotropy and evolvability.

Evolvability is the ability to respond to a selective challenge. This requires the capacity to produce the right kind of variation for selection to act upon. To understand evolvability we therefore need to understand the variational properties of biological organisms. Modularity is a variational property, which has been linked to evolvability. If different characters are able to vary independen...

متن کامل

Comparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints

The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of evolutionary biology

دوره 21 5  شماره 

صفحات  -

تاریخ انتشار 2008